Constructing Semantic Automata for Quantifier Iterations
نویسندگان
چکیده
We expand on recent work extending the semantic automata model of quantifier verification to iteration. We demonstrate a simple and intuitive method to construct a minimal iteration DFA from two DFA recognizing monadic regular quantifier languages and prove that deterministic CFL are also closed under quantifier iteration. We also touch upon the relation between computational results and linguistic discussion of Frege boundary.
منابع مشابه
Deterministic Automata and Extensions of Weak MSO
We introduce a new class of automata on infinite words, called min-automata. We prove that min-automata have the same expressive power as weak monadic second-order logic (weak MSO) extended with a new quantifier, the recurrence quantifier. These results are dual to a framework presented in [2], where max-automata were proved equivalent to weak MSO extended with an unbounding quantifier. We also...
متن کاملProbabilistic semantic automata in the verification of quantified statements
Strategies used by people to verify quantified sentences, like ‘Most cars are white’, have been a popular research topic on the intersection of linguistics, computer science, philosophy, and psychology. A prominent computational model of the task, semantic automata, has been introduced by van Benthem in 1983. In this paper we present a probabilistic extension of the model. We show that the mode...
متن کاملWitness Sets, Polarity Reversal and the Processing of Quantified Sentences
Experimental results show that the monotonicity of a quantifier (Q) affects how it is processed [4, 7, 6]. Q′s are upward entailing (UE) if they permit inferences to supersets, i.e. from Q A B follows Q A B’ for any B ⊆ B′ (e.g. every, at least five). If from Q A B it follows that Q A B’ for any B′ ⊆ B, the quantifier Q is downward entailing (DE) (e.g. no, at most five). As compared to UE Q’s, ...
متن کاملIncremental Neo-Davidsonian semantic construction for TAG
We propose a Neo-Davidsonian semantics approach as a framework for constructing a semantic interpretation simultaneously with a strictly incremental syntactic derivation using the PLTAG formalism, which supports full connectedness of all words under a single node at each point in time. This paper explains why Neo-Davidsonian semantics is particularly suitable for incremental semantic constructi...
متن کاملLearning First Order Quantifier Denotations An Essay in Semantic Learnability
This paper addresses the problem of how a learner would associate a denotation with a determiner on the basis of the pairing of a simple sentence with some perceptual input. Following work by van Benthem (1985), first order quantification is simulated with (a subclass of) finite state automata. Results from Angluin (1988) are used to demonstrate the learnability of this class. Comments Universi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016